<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Data Structures for Sets and Graphs: graphs/GraphAlgorithm.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Data Structures for Sets and Graphs
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_014563f092b9a36e69e485d819dd177d.html">graphs</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">GraphAlgorithm.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="GraphAlgorithm_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * GraphAlgorithm.h</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> *  Created on: 02/09/2012</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> *      Author: marcio</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#ifndef GRAPHALGORITHM_H_</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define GRAPHALGORITHM_H_</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="DirectlyAddressedSet_8h.html">DirectlyAddressedSet.h</a>&quot;</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="BitMapDirectlyAddressedSet_8h.html">BitMapDirectlyAddressedSet.h</a>&quot;</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="Graph_8h.html" title="A data structure representing a Simple Graph.">Graph.h</a>&quot;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="heap_8h.html">heap.h</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &lt;cstring&gt;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html">   38</a></span>&#160;<span class="keyword">class </span><a class="code" href="classGraphAlgorithm.html" title="This class encapsulates a set of algorithms to handle a graph structure.">GraphAlgorithm</a> {</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a0a89fb328b76f61b8103b3ef010655f8" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">greedyCoverSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a39dce6a44f59201d547bd35a64f6a894" title="Determines a greedy coloring of the subgraph induced by the specified vertices using the Dsatur algor...">dsaturCoverSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#acdd1e0bf45f0040c594c8050c4e83d7f" title="Cover the vertexes of the graph according its degree and the degree of its neighbours.">mcrCoverSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r);</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a26f0509b1db30fc8e70ae68210f924bb" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">greedySort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro);</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#aabbc78c9253e35abd4f7cfe7c9b8f457" title="Made a greedy coloring of the subgraph induced by the vertexes in R, using the DSatur algorithm...">dsaturSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro);</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a56d117e88fa337cea787c7bbacefd2fc" title="Order the vertexes of the graph according its degree and the degree of its neighbours.">mcrSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro);</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#ae94ab22f3b0f30d451c3726a1d8e00f9" title="Determine the connected components of a graph.">connectedComponents</a>(<a class="code" href="classGraph.html">Graph</a> * g, T ** comp, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory);</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#ae94ab22f3b0f30d451c3726a1d8e00f9" title="Determine the connected components of a graph.">connectedComponents</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* comp, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory);</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        <span class="keyword">static</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * <a class="code" href="classGraphAlgorithm.html#a4a04fc86447c53b90f54f27ad270f5a9" title="Reads a graph from a file.">readDimacsGraph</a>(FILE * graphFile, <a class="code" href="Graph_8h.html#aa2142693629eb28bcfd13af8886f2786" title="the type of the graph">graphType</a> t, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span> * handle);</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a26f0509b1db30fc8e70ae68210f924bb" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">greedySort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a0a89fb328b76f61b8103b3ef010655f8" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">greedyCoverSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#aabbc78c9253e35abd4f7cfe7c9b8f457" title="Made a greedy coloring of the subgraph induced by the vertexes in R, using the DSatur algorithm...">dsaturSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a39dce6a44f59201d547bd35a64f6a894" title="Determines a greedy coloring of the subgraph induced by the specified vertices using the Dsatur algor...">dsaturCoverSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classGraphAlgorithm.html#a56d117e88fa337cea787c7bbacefd2fc" title="Order the vertexes of the graph according its degree and the degree of its neighbours.">mcrSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classGraphAlgorithm.html#ae6a8ad3b9116d9819750a303a97e91dd">mcrDegreeSort</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* maxd, <span class="keywordtype">long</span>* rank);</div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code" href="classGraphAlgorithm.html#aba419ef2867be6cbb0cad4ad4076791c">FCP2</a>(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>** rank);</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;};</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;</div>
<div class="line"><a name="l00387"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">  387</a></span>&#160;<span class="keywordtype">long</span>* <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a>;</div>
<div class="line"><a name="l00388"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">  388</a></span>&#160;<span class="keywordtype">long</span>* <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a>;</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;</div>
<div class="line"><a name="l00390"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">  390</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>(<span class="keyword">const</span> <span class="keywordtype">void</span>* a, <span class="keyword">const</span> <span class="keywordtype">void</span>* b){</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        <span class="keywordtype">int</span> ret = <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a>[*(<span class="keywordtype">long</span>*)a] - <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a>[*(<span class="keywordtype">long</span>*)b];</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;        <span class="keywordflow">if</span>(ret != 0) <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">return</span> <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a>[*(<span class="keywordtype">long</span>*)a] - <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a>[*(<span class="keywordtype">long</span>*)b];</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;}</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00397"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a0a89fb328b76f61b8103b3ef010655f8">  397</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::greedyCoverSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;        <span class="keywordtype">long</span> i, v, co, n = g-&gt;nverts();</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;        <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet</a> * colors[n];</div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;        <span class="comment">//induced subgraph</span></div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;        <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet</a> * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;<a class="code" href="classDirectlyAddressedSet.html#a65c7a90ea3d3c767a2a8dbe0f9cde2ee" title="Adds the specified key to the set (optional operation).">toSet</a>(R[j]);</div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;        <span class="comment">//initialize the colors, each vetor represents the set of colors avaible for</span></div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;        <span class="comment">//each vertex.</span></div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++)</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;                colors[j] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;        <span class="comment">//greedy coloring</span></div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;        <span class="keywordflow">while</span>(i &lt; r ){</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;                <span class="comment">//in order visit each vertex of R</span></div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;                v = R[i++];</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;                co = colors[v]-&gt;<a class="code" href="classDirectlyAddressedSet.html#a798e2503651986e33dd7af1e510f50a6" title="Determine the first element of the complement of the set represented by the current object...">firstInCompl</a>();</div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;                <span class="comment">//determine its color</span></div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++)<span class="keywordflow">if</span>(R[j] == v) (*cover)[j] = co;</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;                <span class="comment">//remove the color to the possible colors of its neigbours</span></div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR);</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;                        colors[iti]-&gt;<a class="code" href="classDirectlyAddressedSet.html#a65c7a90ea3d3c767a2a8dbe0f9cde2ee" title="Adds the specified key to the set (optional operation).">toSet</a>(co);</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;                }</div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;        }</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        <span class="comment">//clean memory</span></div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;                <span class="keyword">delete</span> colors[j];</div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;</div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;}</div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00437"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a39dce6a44f59201d547bd35a64f6a894">  437</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::dsaturCoverSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        <span class="keywordtype">long</span> v, u, n = g-&gt;nverts();</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="comment">//creates a bit map to the elements in R to be used as a filter</span></div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        T * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        <span class="keywordtype">long</span> * invR = <span class="keyword">new</span> <span class="keywordtype">long</span>[n];</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++) {</div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;                bitR-&gt;<a class="code" href="classDirectlyAddressedSet.html#a65c7a90ea3d3c767a2a8dbe0f9cde2ee" title="Adds the specified key to the set (optional operation).">toSet</a>(R[j]);</div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;                invR[R[j]] = j;</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;        }</div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;</div>
<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;        <span class="comment">//initializes the vector of degrees</span></div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;        <span class="keywordtype">long</span> * degree = <span class="keyword">new</span> <span class="keywordtype">long</span>[n];</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;        T * degR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;                degR-&gt;allToCompl();</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html#a1a8f42e33423c79e0b20174797381286" title="Implementation of the intersection operation using filtered iteration and bit parallelism.">BitMapDirectlyAddressedSets&lt;Z&gt;::intersectOf</a>(degR, bitR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;        }</div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;        <span class="keyword">delete</span> degR;</div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;</div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        <span class="comment">//initializes the vector of saturation degrees</span></div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;        <span class="keywordtype">long</span>* satdegree = <span class="keyword">new</span> <span class="keywordtype">long</span>[n];</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        memset(satdegree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;</div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        <span class="comment">//builds a heap with the elements in R according to saturation degrees</span></div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        <span class="keywordtype">long</span> * RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        memcpy(RR, R, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a> = degree;</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a> = satdegree;</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;</div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;        <span class="comment">//initialize the vector of colors</span></div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;        T * colors[n];</div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++)</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;                colors[R[j]] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        <span class="comment">//coloring</span></div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;        <span class="keywordtype">long</span> i = r, color;</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;        <a class="code" href="classAndFilter.html" title="Filter for thelogic operation and.">AndFilter</a> * andFilter = <span class="keyword">new</span> <a class="code" href="classAndFilter.html" title="Filter for thelogic operation and.">AndFilter</a>();</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;        <span class="keywordflow">while</span>(i &gt;= 0) {</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;                <span class="comment">//color the first in the heap</span></div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;                v = RR[0];</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;                color = colors[v]-&gt;firstInCompl();</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                (*cover)[invR[R[j]]] = color;</div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;                <span class="comment">//update the saturation degree of its neighbors</span></div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR, andFilter);</div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;                u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;                <span class="keywordflow">while</span> (u &lt; iu) {</div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                        colors[u]-&gt;toSet(color);</div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;                        satdegree[u]++;</div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;                        u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;                }</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;                <span class="keyword">delete</span> it;</div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;</div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;                <span class="comment">//update the heap</span></div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;        }</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;        <span class="keyword">delete</span> andFilter;</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;        <span class="keyword">delete</span>[] RR;</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        <span class="keyword">delete</span>[] satdegree;</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        <span class="keyword">delete</span>[] degree;</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;        <span class="keyword">delete</span>[] invR;</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;        <span class="keywordflow">for</span> (j = 0 ; j &lt; r; j++)</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;                <span class="keyword">delete</span> colors[R[j]];</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;        <span class="keyword">delete</span>[] colors;</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;        <span class="keyword">delete</span> bitR;</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;}</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00515"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#acdd1e0bf45f0040c594c8050c4e83d7f">  515</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::mcrCoverSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r) {</div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <span class="keywordtype">long</span> n = g-&gt;nverts();</div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        <span class="keywordtype">long</span> degin[n];</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        <span class="keywordtype">long</span> degree[n];</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;        <span class="keywordtype">long</span> i = r;</div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;        <span class="keywordtype">long</span> v;</div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;</div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;        <span class="comment">//maximum minimum degree</span></div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        <span class="keywordtype">long</span> maxmindeg = 0;</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;        <span class="comment">//to use the same function of comparation</span></div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a> = degree;</div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a> = degin;</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;        memset(degin, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;        memset(degree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;</div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;        <span class="comment">//sets to represent R.</span></div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        T * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        T * degR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;                degR-&gt;allToSet();</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, bitR);</div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;        }</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;</div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        <span class="keywordtype">long</span>* RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        memcpy(R,RR,r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;</div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;        <span class="comment">//ordering</span></div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;        <span class="keywordflow">while</span>(i &gt; 0){</div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;                <span class="comment">//determine the head of the heap</span></div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;                v = RR[0];</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;                maxmindeg = maxmindeg &lt; degin[v]? degin[v] : maxmindeg;</div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>),<a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;</div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;                <span class="comment">//update info</span></div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++)<span class="keywordflow">if</span>(R[j] == v) (*cover)[j] = i;</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;                it = g-&gt;neig(v)-&gt;newSetIterator(bitR);</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;                        degin[iti]++;</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;                }</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;        }</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;        <span class="keywordflow">return</span> maxmindeg;</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;}</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00571"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a26f0509b1db30fc8e70ae68210f924bb">  571</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::greedySort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro) {</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;        <span class="keywordtype">long</span> i, v, co, n = g-&gt;nverts();</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;        T * colors[n];</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;        T * vert[n];</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        <span class="comment">//induced subgraph</span></div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;        T * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;        <span class="comment">//initialize the colors, each vetor represents the set of colors avaible for</span></div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;        <span class="comment">//each vertex.</span></div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++){</div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;                colors[j] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;                vert[j] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        }</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;        <span class="comment">//coloring</span></div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;        <span class="keywordflow">while</span>(i &lt; r ){</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;                <span class="comment">//visit a vertex</span></div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;                v = R[i++];</div>
<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;</div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;                <span class="comment">//give a color</span></div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;                co = colors[v]-&gt;firstInCompl();</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;                vert[co]-&gt;toSet(v);</div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;                <span class="comment">//update the vetors of its neigbours</span></div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR);</div>
<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;                        colors[iti]-&gt;toSet(co);</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;                }</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;        }</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;        <span class="comment">//fill in the vectos cover and Ro</span></div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;        <span class="keywordtype">long</span> index = 0;</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++){</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;                it = vert[j]-&gt;newIterator();</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;                        (*Ro)[index] = iti;</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;                        (*cover)[index++] = j;</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;                }</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        }</div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;</div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="comment">//clean memory</span></div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++){</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;                <span class="keyword">delete</span> vert[j];</div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;                <span class="keyword">delete</span> colors[j];</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        }</div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;}</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00630"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#aabbc78c9253e35abd4f7cfe7c9b8f457">  630</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::dsaturSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro) {</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="keywordtype">long</span> i = r, v, u, co, n = g-&gt;nverts();</div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        <span class="keywordtype">long</span>* satdegree = <span class="keyword">new</span> <span class="keywordtype">long</span>[n];</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="keywordtype">long</span>* degree = <span class="keyword">new</span> <span class="keywordtype">long</span>[n];</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a> = satdegree;</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a> = degree;</div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;        memset(satdegree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;        <span class="keywordtype">long</span>* RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        memcpy(R,RR,r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        T * colors[n];</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;        T * vert[n];</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;        <span class="comment">//bit set to represent R</span></div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet</a> * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;<a class="code" href="classDirectlyAddressedSet.html#a65c7a90ea3d3c767a2a8dbe0f9cde2ee" title="Adds the specified key to the set (optional operation).">toSet</a>(R[j]);</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        <span class="comment">//color avaible to each vertex</span></div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++){</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;                colors[j] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;                vert[j] = factory-&gt;newInstance(r);</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        }</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        T * degR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="comment">//calcute the degree in the subgraph</span></div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;                degR-&gt;allToSet();</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, bitR);</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        }</div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        <span class="comment">//coloring</span></div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="keywordflow">while</span>(i &gt;= 0){</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;                <span class="comment">//visit the vertex</span></div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;                v = RR[0];</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>),<a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;</div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;                <span class="comment">//determine its color</span></div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;                co = colors[v]-&gt;firstInCompl();</div>
<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;                vert[co]-&gt;toSet(v);</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;</div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;                <span class="comment">//update the colors avaible in the neighbours</span></div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR);</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;                u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;                <span class="keywordflow">while</span>(u &lt; iu) {</div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;                        colors[u]-&gt;toSet(co);</div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;                        satdegree[u]++;</div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                        u = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;                }</div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        }</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;</div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;        <span class="comment">//ordering</span></div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;        <span class="keywordtype">long</span> index = 0;</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++){</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;                it = vert[j]-&gt;newIterator();</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;                        (*Ro)[index] = iti;</div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;                        (*cover)[index++] = j;</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;                }</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        }</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;</div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; n; j++){</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;                <span class="keyword">delete</span> vert[j];</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;                <span class="keyword">delete</span> colors[j];</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;        }</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;        <span class="keyword">delete</span> satdegree;</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;        <span class="keyword">delete</span> degree;</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;}</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00713"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a56d117e88fa337cea787c7bbacefd2fc">  713</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::mcrSort&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>** cover, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">long</span>* R, <span class="keywordtype">long</span> r, <span class="keywordtype">long</span>** Ro) {</div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;        <span class="keywordtype">long</span> n = g-&gt;nverts();</div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;        <span class="keywordtype">long</span> degin[n];</div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;        <span class="keywordtype">long</span> degree[n];</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;        <span class="keywordtype">long</span> i = r;</div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;        <span class="keywordtype">long</span> v;</div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;        <span class="keywordtype">long</span> maxmindeg = 0;</div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;        <span class="keywordtype">long</span> maxdeg = 0;</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;</div>
<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a01bad7b1beb4964ae6563724e67d019d">graphs_deg</a> = degree;</div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a7b131fb36ec93cc19fd43717017647df">graphs_sat</a> = degin;</div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;</div>
<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;        memset(degin, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        memset(degree, 0, n*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;</div>
<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;        T * bitR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        T * degR = factory-&gt;newInstance(n);</div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0 ; j &lt; r; j++)bitR-&gt;toSet(R[j]);</div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;</div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;        <span class="comment">//calculate the degree in the subgraph</span></div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 0; j &lt; r; j++) {</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;                degR-&gt;allToSet();</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, bitR);</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;                <a class="code" href="classBitMapDirectlyAddressedSets.html">BitMapDirectlyAddressedSets&lt;Z&gt;::setIntersec</a>(degR, g-&gt;neig(R[j]));</div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;                degree[R[j]] = degR-&gt;cardOfSet();</div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;                maxdeg = maxdeg &lt; degree[R[j]]? degree[R[j]] : maxdeg;</div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;        }</div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;</div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;        <span class="keywordtype">long</span>* RR = <span class="keyword">new</span> <span class="keywordtype">long</span>[r];</div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;        memcpy(R,RR,r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;        <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, r, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a>* it;</div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;</div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;        <span class="comment">//ordering</span></div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;        <span class="keywordflow">while</span>(i &gt; 0){</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;                (*Ro)[i] = v = RR[0];</div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;                maxmindeg = maxmindeg &lt; degin[v]? degin[v] : maxmindeg;</div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;                <a class="code" href="heap_8c.html#a3c44c87035bb56d56d977b17bb2df558">heappoll</a>(RR, i--, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>),<a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;                (*cover)[i] = i &lt; maxdeg ? i : maxdeg;</div>
<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;                it = g-&gt;neig(v)-&gt;newIterator(bitR);</div>
<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;                <span class="keywordtype">long</span> iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;                <span class="keywordtype">long</span> iu = g-&gt;neig(v)-&gt;universeSize();</div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;                <span class="keywordflow">while</span>(iti &lt; iu) {</div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;                        degin[iti]++;</div>
<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;                        iti = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;                }</div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;                <a class="code" href="heap_8c.html#abf6db9c52c0af825f656899af4ffe24b">heapify</a>(RR, i, <span class="keyword">sizeof</span>(<span class="keywordtype">long</span>), <a class="code" href="GraphAlgorithm_8h.html#a0b3c13351805ae0920ce8d447d70ee51">graphs_compar</a>);</div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;        }</div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;        <span class="keywordflow">return</span> maxmindeg;</div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;}</div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00765"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#ae94ab22f3b0f30d451c3726a1d8e00f9">  765</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::connectedComponents&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, T ** comp, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory){</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;}</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;</div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00771"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a55869e06519f12f1274fa1ce06ee10e0">  771</a></span>&#160;<span class="keywordtype">long</span> GraphAlgorithm::connectedComponents&lt;T&gt;(<a class="code" href="classGraph.html">Graph</a> * g, <span class="keywordtype">long</span>* comp, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory) {</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;}</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00777"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#a4a04fc86447c53b90f54f27ad270f5a9">  777</a></span>&#160;<a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * GraphAlgorithm::readDimacsGraph&lt;T&gt;(FILE* graphFile, <a class="code" href="Graph_8h.html#aa2142693629eb28bcfd13af8886f2786" title="the type of the graph">graphType</a> t, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span> * handle) {</div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;        <span class="keywordtype">char</span> type = <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;        <span class="keywordtype">char</span> linestr[100];</div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;        <span class="keywordtype">char</span>* datastr;</div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;        <span class="keywordtype">long</span> i, j;</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;        <span class="keywordtype">long</span> n;</div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;        <span class="keywordtype">long</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> m;</div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;        n = 0;</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        m = 0;</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;</div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;        printf(<span class="stringliteral">&quot;\t#Starting read...\n&quot;</span>);</div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;</div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;        <span class="keywordflow">while</span> (type != <span class="charliteral">&#39;p&#39;</span>) {</div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;                type = fgetc(graphFile);</div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;                <span class="keywordflow">if</span> (type != EOF) {</div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;</div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;                        <span class="comment">/* header */</span></div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;                        <span class="keywordflow">if</span> (type == <span class="charliteral">&#39;c&#39;</span>) {</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;                                datastr = fgets(linestr, 100, graphFile);</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;                                <span class="keywordflow">if</span> (datastr != NULL)</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;                                        printf(<span class="stringliteral">&quot;%s&quot;</span>, linestr);</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;                                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;                                        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;                        }</div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;                        <span class="comment">/* Vertices */</span></div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;                        <span class="keywordflow">if</span> (type == <span class="charliteral">&#39;p&#39;</span>) {</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;                                datastr = fgets(linestr, 100, graphFile);</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;                                <span class="keywordflow">if</span> (datastr == NULL)</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;                                        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;                                datastr = strtok(linestr,<span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;                                printf(<span class="stringliteral">&quot;\tdatastr:%s\n&quot;</span>,datastr);</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;                                n = atoi(datastr);</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;</div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;                                datastr = strtok(NULL,<span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;                                printf(<span class="stringliteral">&quot;\tdatastr:%s\n&quot;</span>,datastr);</div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;                                m = atoll(datastr);</div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;</div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;                                        printf(<span class="stringliteral">&quot;Graph with (%lu) vertices and (%llu) edges.\n&quot;</span>, n, m);</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;                                <span class="keywordflow">if</span> (t == <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a7fb2b4bfd7da5bb2a6b32119043bb156">GT_COMPLEMENT</a>)</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;                                        m = ((((<span class="keywordtype">long</span> long) (n))*((<span class="keywordtype">long</span> <span class="keywordtype">long</span>) (n)) - ((<span class="keywordtype">long</span> long) n)) &gt;&gt; ((<span class="keywordtype">long</span> <span class="keywordtype">long</span>) 1)) - m;</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;                        }</div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;                }</div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;        }</div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;        <span class="comment">// Graph variables</span></div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;<span class="comment"></span>        T * g = factory-&gt;newInstance(n, handle);</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;        <span class="keywordflow">if</span> (t != <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a6de81ce1f98c4f6a9cb9cc37e33dd305">GT_GRAPH</a>) {</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;                g-&gt;addAllEdges();</div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;                <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;                        g-&gt;delEdge(i, i);</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        }</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;        type = fgetc(graphFile);</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;        <span class="keywordflow">while</span> (type != EOF) {</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;                <span class="comment">/* Edges */</span></div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;                <span class="keywordflow">if</span> (type == <span class="charliteral">&#39;e&#39;</span>) {</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;                        datastr = fgets(linestr, 100, graphFile);</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;                        <span class="keywordflow">if</span> (datastr == NULL)</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;                                <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;                        datastr = strtok(linestr,<span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;                        i = atoi(datastr) - 1;</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;                        datastr = strtok(NULL,<span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;                        j = atoi(datastr) - 1;</div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;</div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;                        <span class="keywordflow">if</span> (t == <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a6de81ce1f98c4f6a9cb9cc37e33dd305">GT_GRAPH</a>)</div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;                                g-&gt;addEdge(i, j);</div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;                        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;                                g-&gt;delEdge(i, j);</div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;                }</div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;                <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;                        datastr = fgets(linestr, 100, graphFile);</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;                        <span class="keywordflow">if</span> (datastr != NULL)</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;                                printf(<span class="stringliteral">&quot; %s\n&quot;</span>, linestr);</div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;                        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;                                <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;                }</div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;                type = fgetc(graphFile);</div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;        }</div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;        g-&gt;countnegdes();</div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        printf(<span class="stringliteral">&quot;\t#Finished read\n&quot;</span>);</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;}</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;<span class="comment">//&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;Old functions inherit from the old implementation&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;.</span></div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;</div>
<div class="line"><a name="l00867"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a5323a965dacf2a0b2899756ea7757903">  867</a></span>&#160;<span class="preprocessor">#define graphs_declareListForAssignment(r,k)    long _i_; \</span></div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;<span class="preprocessor">                                                        long _next_[r+1]; \</span></div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;<span class="preprocessor">                                                        for (_i_ = 0; _i_ &lt;= r; _i_++) _next_[_i_] = r; \</span></div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;<span class="preprocessor">                                                        long _covhead_[k+1]; \</span></div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;<span class="preprocessor">                                                        for (_i_ = 0; _i_ &lt;= k; _i_++) _covhead_[_i_] = r</span></div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00873"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#ae1579b0f05e45332ca5dd69c2c3b3bb8">  873</a></span>&#160;<span class="preprocessor">#define callAssignClique(g, k, cover, i, coversize)     assignCliqueByMatrix(g, k, cover, i, &amp;coversize, _next_, _covhead_)</span></div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;</div>
<div class="line"><a name="l00876"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a77afdc36da863fbce2f11e9551ec4fba">  876</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="GraphAlgorithm_8h.html#a77afdc36da863fbce2f11e9551ec4fba">graphs_assignCliqueByBitParallel</a>(<span class="keywordtype">long</span> **colors, <span class="keywordtype">long</span> **adj, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span> wordsize, <span class="keywordtype">long</span> adj_bitl, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span> mincolor, <span class="keywordtype">long</span> *coversize) {</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;      <span class="keywordtype">long</span> c=0,j=0,found=0;</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;      <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> aux=0;</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;</div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;      <span class="keywordflow">for</span> (c = mincolor; c &lt; (*coversize); c++) {</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;              <span class="keywordflow">for</span>(j = 0; j &lt; adj_bitl; j++) {</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;                   aux= colors[c][j] &amp; adj[i][j];    <span class="comment">// We are not using mask to zero vertex out of scope</span></div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;                   <span class="keywordflow">if</span>(aux!=0) {</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;                      found = 0;</div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;                      <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;                   }</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;                   <span class="keywordflow">else</span> found = 1;</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;              }</div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;              <span class="keywordflow">if</span>(found) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;      }</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;      <span class="keywordflow">if</span>(c &lt;= k) {</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;           colors[c][i/wordsize] |= (1 &lt;&lt; (wordsize - (i%wordsize) -1));</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;           <span class="keywordflow">if</span>( (c+1) &gt; (*coversize) ) (*coversize)++;</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;      }</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;</div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;      <span class="keywordflow">return</span> c + 1;</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;}</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;<span class="comment">// sort specified vertices of a specified graph in a non-increasing order of degrees, in the</span></div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;<span class="comment">// following sense:</span></div>
<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;<span class="comment">// in a subgraph of the specified graph induced by a set of vertices V = {V_1,V_2, ... ,V_i}, for 1 ≤ i ≤ r,</span></div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;<span class="comment">// it holds that V_i always has the maximum rank and the minimum degree in V.</span></div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="comment">// exdeg is used to break ties</span></div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;<span class="comment">// 2 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;<span class="comment">// vertices R[j] having rank[j]=min { rank[i] | i=0,1,...,r-1 } induce a regular subgraph</span></div>
<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;<span class="comment">// mcr order is obtained by sorting R in a non-increasing order of rank</span></div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classGraphAlgorithm.html#a56d117e88fa337cea787c7bbacefd2fc" title="Order the vertexes of the graph according its degree and the degree of its neighbours.">GraphAlgorithm&lt;T, Z&gt;::mcrSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;        <span class="comment">// degrees used locally</span></div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;        <span class="keywordtype">long</span> r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;        <span class="keywordtype">long</span> locald[r];</div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;        memcpy(locald, d, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        <span class="comment">// used to break ties</span></div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;        <span class="keywordtype">long</span> exdeg[r];</div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;        <span class="comment">// a negative number indicates that this parameter is not known</span></div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;        memset(exdeg, -1, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;        <span class="comment">// determine min deg</span></div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;        <span class="keywordtype">long</span> Rmin[r];</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        <span class="keywordtype">long</span> nrmin = 1;</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;        <span class="keywordtype">long</span> i = r - 1;</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;        <span class="keywordtype">long</span> imin = 0;</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;        Rmin[0] = imin;</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;        <span class="keywordtype">long</span> degrmin = locald[imin];</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;        <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                <span class="keywordflow">if</span> (locald[j] &lt; degrmin) {</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;                        nrmin = 1;</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;                        Rmin[0] = j;</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;                        degrmin = locald[j];</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;                }</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (locald[j] == degrmin)</div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;        <span class="keywordtype">long</span> rmin;</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;        <span class="keywordflow">while</span> (i &gt;= nrmin) {</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;                rmin = 0;</div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;                <span class="keywordflow">if</span> (nrmin &gt; 1) {</div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;                        <span class="keywordflow">for</span> (j = 1; j &lt; nrmin; j++) {</div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[rmin]] &lt; 0) {</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;                                        exdeg[Rmin[rmin]]=0;</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;                                        <span class="keywordflow">for</span> (l = 0; l &lt; locald[Rmin[rmin]]; l++)</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;                                                <span class="keywordflow">if</span> (!rank[ng[Rmin[rmin]][l]])</div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;                                                        exdeg[Rmin[rmin]] += locald[ng[Rmin[rmin]][l]];</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;                                }</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; 0) {</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;                                        exdeg[Rmin[j]]=0;</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;                                        <span class="keywordflow">for</span> (l = 0; l &lt; locald[Rmin[j]]; l++)</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;                                                <span class="keywordflow">if</span> (!rank[ng[Rmin[j]][l]])</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;                                                        exdeg[Rmin[j]] += locald[ng[Rmin[j]][l]];</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;                                }</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; exdeg[Rmin[rmin]])</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;                                        rmin = j;</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;                        }</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;                }</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;                rank[Rmin[rmin]] = --i;</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;                <span class="keywordflow">while</span> (rank[imin])</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;                        imin++;</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;                <span class="keywordflow">for</span> (j = 0; j &lt; locald[Rmin[rmin]]; j++)</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;                        <span class="keywordflow">if</span> (!rank[ng[Rmin[rmin]][j]]) {</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;                                exdeg[ng[Rmin[rmin]][j]] -= locald[Rmin[rmin]];</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;                                locald[ng[Rmin[rmin]][j]]--;</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;                        }</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;                Rmin[0] = imin;</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;                nrmin = 1;</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;                degrmin = locald[imin];</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;                <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;                        <span class="keywordflow">if</span> (!rank[j])</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;                                <span class="keywordflow">if</span> (locald[j] &lt; degrmin) {</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;                                        nrmin = 1;</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;                                        Rmin[0] = j;</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;                                        degrmin = locald[j];</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;                                }</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;                                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (locald[j] == degrmin)</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;                                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;        }</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;        <span class="keywordtype">long</span> maxno = 0;</div>
<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;        --i;</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;                <span class="keywordflow">if</span> (!rank[j]) {</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;                        rank[j] = i;</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;                        maxno++;</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;                }</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;        <span class="keywordflow">return</span> locald[imin] == maxno - 1;</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;}</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;<span class="comment">// sort specified vertices of a specified graph in a non-increasing order of degrees, in the</span></div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;<span class="comment">// following sense:</span></div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;<span class="comment">// in a subgraph of the specified graph induced by a set of vertices V = {V_1,V_2, ... ,V_i}, for 1 ≤ i ≤ r,</span></div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;<span class="comment">// it holds that V_i always has the maximum rank and the minimum degree in V.</span></div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;<span class="comment">// exdeg is used to break ties; maximum rank is returned</span></div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;<span class="comment">// 3 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;<span class="comment">// if true is returned, then vertices R[j] having rank[j]=max rank induce a clique</span></div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01004"></a><span class="lineno"><a class="code" href="classGraphAlgorithm.html#ae6a8ad3b9116d9819750a303a97e91dd"> 1004</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classGraphAlgorithm.html#ae6a8ad3b9116d9819750a303a97e91dd">GraphAlgorithm&lt;T, Z&gt;::mcrDegreeSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> * maxd, <span class="keywordtype">long</span> * rank) {</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;        <span class="comment">// degrees used locally</span></div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;        <span class="keywordtype">long</span> i, j, r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;        <span class="keywordtype">long</span> deg[r];</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;        memset(deg, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;        <span class="comment">// used to break ties</span></div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;        <span class="keywordtype">long</span> exdeg[r];</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;        *maxd = 0;</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;                <span class="keywordflow">for</span> (j = i + 1; j &lt; r; j++)</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;                        <span class="keywordflow">if</span> (g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(i, j)) {</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;                                <span class="keywordflow">if</span> (++deg[i] &gt; *maxd)</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;                                        *maxd = deg[i];</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;                                <span class="keywordflow">if</span> (++deg[j] &gt; *maxd)</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;                                        *maxd = deg[j];</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;                        }</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;                exdeg[i] = -1;</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;        }</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;        <span class="comment">// determine min deg</span></div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;        <span class="keywordtype">long</span> Rmin[r];</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;        <span class="keywordtype">long</span> nrmin = 1;</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;        <span class="keywordtype">long</span> imin = 0;</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;        Rmin[0] = imin;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;        <span class="keywordtype">long</span> degrmin = deg[imin];</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;        <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;                <span class="keywordflow">if</span> (deg[j] &lt; degrmin) {</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;                        nrmin = 1;</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;                        Rmin[0] = j;</div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;                        degrmin = deg[j];</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;                }</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (deg[j] == degrmin)</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;        <span class="keywordtype">long</span> rmin;</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;        i = r;</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;        <span class="keywordflow">while</span> (i &gt; nrmin) {</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;                rmin = 0;</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;                <span class="keywordflow">if</span> (nrmin &gt; 1) {</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;                        <span class="keywordflow">if</span> (exdeg[Rmin[rmin]] &lt; 0) {</div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;                                exdeg[Rmin[rmin]]=0;</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;                                <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;                                <span class="keywordflow">for</span> (l = imin; l &lt; r; l++)</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;                                        <span class="keywordflow">if</span> (rank[l] == 0 &amp;&amp; l != Rmin[rmin] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(Rmin[rmin], l))</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;                                                exdeg[Rmin[rmin]] += deg[l];</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;                        }</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;                        <span class="keywordflow">for</span> (j = 1; j &lt; nrmin; j++) {</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; 0) {</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;                                        exdeg[Rmin[j]]=0;</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;                                        <span class="keywordtype">long</span> l;</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;                                        <span class="keywordflow">for</span> (l = imin; l &lt; r; l++)</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;                                                <span class="keywordflow">if</span> (rank[l] == 0 &amp;&amp; l != Rmin[j] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(Rmin[j], l))</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;                                                        exdeg[Rmin[j]] += deg[l];</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;                                }</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;                                <span class="keywordflow">if</span> (exdeg[Rmin[j]] &lt; exdeg[Rmin[rmin]])</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;                                        rmin = j;</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;                        }</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;                }</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;                rank[Rmin[rmin]] = i--;</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;                <span class="keywordflow">while</span> (rank[imin] != 0)</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;                        imin++;</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;                <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;                        <span class="keywordflow">if</span> (rank[j] == 0 &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(Rmin[rmin], j)) {</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;                                exdeg[j] -= deg[Rmin[rmin]];</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;                                deg[j]--;</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;                        }</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;                Rmin[0] = imin;</div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;                nrmin = 1;</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;                degrmin = deg[imin];</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;                <span class="keywordflow">for</span> (j = imin + 1; j &lt; r; j++)</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;                        <span class="keywordflow">if</span> (rank[j] == 0)</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;                                <span class="keywordflow">if</span> (deg[j] &lt; degrmin) {</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;                                        nrmin = 1;</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;                                        Rmin[0] = j;</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;                                        degrmin = deg[j];</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;                                }</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;                                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (deg[j] == degrmin)</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;                                        Rmin[nrmin++] = j;</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;        }</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;        <span class="keywordtype">long</span> maxno = 0;</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;<span class="comment">//      --i;</span></div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;        <span class="keywordflow">for</span> (j = imin; j &lt; r; j++)</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;                <span class="keywordflow">if</span> (rank[j] == 0) {</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;                        rank[j] = i;</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;                        maxno++;</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;                }</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;        <span class="keywordflow">return</span> deg[imin] == maxno - 1;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;}</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;</div>
<div class="line"><a name="l01099"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#a32e148dcccc8b8059e1760623f81b84c"> 1099</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="GraphAlgorithm_8h.html#a32e148dcccc8b8059e1760623f81b84c">graphs_assignByList</a>(<span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* cover, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span>* coversize, <span class="keywordtype">long</span>* clique) {</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;        <span class="keywordtype">long</span> j;</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;        <span class="comment">// current clique starts with size 1</span></div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;        cover[i] = 0;</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;        <span class="comment">// find clique to include vertex as the smallest</span></div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;        <span class="comment">// not appearing in the neighborhood of i</span></div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;        memset(clique, 0, ((*coversize)+1)*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;        <span class="keywordflow">for</span> (j = 0; j &lt; d[i]; j++)</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;                clique[cover[ng[i][j]]] = 1;</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;        <span class="keywordtype">long</span> c = 1;</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;        <span class="keywordflow">while</span> (c &lt;= *coversize &amp;&amp; clique[c])</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;                c++;</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;        <span class="keywordflow">if</span> (c &lt;= k) {</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;                <span class="keywordflow">if</span> (c &gt; *coversize)</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;                        (*coversize)++;</div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;                cover[i] = c;</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;        }</div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;        <span class="keywordflow">return</span> c;</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;}</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;<span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a26f0509b1db30fc8e70ae68210f924bb" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">GraphAlgorithm&lt;T, Z&gt;::greedySort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>**  ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;        <span class="keywordtype">long</span> coversize = 0;</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;        <span class="keywordtype">long</span> i, r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;         <span class="comment">// array, indexed by the cliques, used to mark all cliques in the neighborhood of a vertex</span></div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;        <span class="keywordtype">long</span> clique[k+1];</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;                <a class="code" href="GraphAlgorithm_8h.html#a32e148dcccc8b8059e1760623f81b84c">graphs_assignByList</a>(d, ng, k, rank, i, &amp;coversize, clique);</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;        }</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;        <span class="keywordflow">return</span> coversize;</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;}</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01138"></a><span class="lineno"><a class="code" href="GraphAlgorithm_8h.html#aec3e589d618970163e5d62397dbedbc0"> 1138</a></span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="GraphAlgorithm_8h.html#aec3e589d618970163e5d62397dbedbc0">graphs_assignCliqueByMatrix</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* cover, <span class="keywordtype">long</span> i, <span class="keywordtype">long</span>* coversize, <span class="keywordtype">long</span>* next, <span class="keywordtype">long</span>* covhead) {</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;        <span class="keywordtype">long</span> c = 0, r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;        <span class="keywordtype">long</span> cc = covhead[c];</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        <span class="keywordtype">long</span> antcc = r;</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;        <span class="keywordflow">while</span> (!cover[i] &amp;&amp; c &lt; *coversize){</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;                <span class="comment">// search for cover to add</span></div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;                <span class="keywordflow">for</span> (; cc != covhead[c+1] &amp;&amp; g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(i, cc); antcc = cc, cc = next[cc]);</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;                <span class="keywordflow">if</span> (cc == covhead[c+1])</div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;                        cover[i] = c + 1;</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;                <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;                        c++;</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;                        <span class="keywordflow">for</span> (; cc != covhead[c]; antcc = cc, cc = next[cc]);</div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;                }</div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;        }</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;        <span class="keywordflow">if</span> (c == *coversize &amp;&amp; *coversize &lt; k) {</div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;                (*coversize)++;</div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>&#160;                covhead[c] = i;</div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;                cover[i] = c + 1;</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;        }</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;        <span class="comment">// include i in the tail of cover list</span></div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160;        next[antcc] = i;</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160;        next[i] = cc;</div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;        <span class="keywordflow">return</span> c + 1;</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;}</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;<span class="comment">// sort R according to a clique cover of the subgraph induced by R</span></div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;<span class="comment">// clique cover is determined using greedy algorithm in the vertex order specified by the input value of R</span></div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;<span class="comment">// 1 vector of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;<span class="comment">// it returns the size of the clique cover and sets the cover array such that:</span></div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;<span class="comment">// for i in 0, ..., r-1, the entry cover[i] contains the size of a clique</span></div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;<span class="comment">// cover of the subgraph induced by R[0], ..., R[i]</span></div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;<span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a0a89fb328b76f61b8103b3ef010655f8" title="Made a greedy coloring of the subgraph induced by the vertexes in R, with the order that they appear ...">GraphAlgorithm&lt;T, Z&gt;::greedyCoverSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;        <span class="keywordtype">long</span> coversize = 0, r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a5323a965dacf2a0b2899756ea7757903">graphs_declareListForAssignment</a>(r, k);</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160;</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;        <span class="keywordtype">long</span> i;</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;                rank[i] = 0;</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;                <a class="code" href="GraphAlgorithm_8h.html#ae1579b0f05e45332ca5dd69c2c3b3bb8">callAssignClique</a>(g, k, rank, i, coversize);</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;        }</div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;        <span class="keywordflow">return</span> coversize;</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;}</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;<span class="comment">// sort R according to a clique cover or coloring of the subgraph induced by R,</span></div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;<span class="comment">// depending whether d and ng represents neighborhoods or antineighborhoods.</span></div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;<span class="comment">// index in R is used as last break tie condition</span></div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;<span class="comment">// Assuming they represent antineighborhoods, clique cover is determined using dsatur</span></div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160;<span class="comment">// 4 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160;<span class="comment">// it returns the size of the clique cover and sets the cover array such that:</span></div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;<span class="comment">// for i in 0, ..., r-1, the entry cover[i] contains the size of a clique</span></div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;<span class="comment">// cover of the subgraph induced by all vertices of rank less than or equal to cover[i]</span></div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;<span class="comment">// the number of cliques in the cover is returned. Cliques returned in the cover array are numbered from 1 to number of cliques in the</span></div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;<span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#aabbc78c9253e35abd4f7cfe7c9b8f457" title="Made a greedy coloring of the subgraph induced by the vertexes in R, using the DSatur algorithm...">GraphAlgorithm&lt;T, Z&gt;::dsaturSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span>* d, <span class="keywordtype">long</span>** ng, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160;        <span class="keywordtype">long</span> r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;        <span class="keywordtype">long</span> next[r+1];</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;        <span class="keywordtype">long</span> prev[r+1];</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;        <span class="keywordtype">long</span> satdeglist[r];</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;        <span class="keywordtype">long</span> satdeg[r];</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;        <span class="comment">// array, indexed by the cliques, used to mark all cliques in the neighborhood of imaxantideg</span></div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;        <span class="keywordtype">long</span> clique[k+1];</div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160;        <span class="keywordtype">long</span> nclique = 0;</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;        <span class="keywordtype">long</span> i, j;</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;        <span class="comment">// initially, all cliques are empty, all saturation degrees are 0 and</span></div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;        <span class="comment">// its doubly linked list contains all vertices</span></div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160;        memset(satdeg, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;                next[i] = i+1;</div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;                prev[i] = i-1;</div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;                satdeglist[i] = r;</div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;        }</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;        satdeglist[0] = 0;</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;        prev[0] = r;</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;        <span class="keywordtype">long</span> ncovered;</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160;        <span class="keywordtype">long</span> maxsatdeg = 0;</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160;        <span class="keywordtype">long</span> imaxantideg;</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160;        <span class="keywordflow">for</span> (ncovered = 0; ncovered &lt; r; ncovered++) {</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;                <span class="comment">// find vertex with max antideg among those with max satdeg</span></div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;                i = satdeglist[maxsatdeg];</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;                imaxantideg = i;</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;                <span class="keywordflow">while</span> (next[i] &lt; r) {</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160;                        i = next[i];</div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>&#160;                        <span class="keywordflow">if</span> (d[i] &gt; d[imaxantideg])</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160;                                imaxantideg = i;</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160;                }</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160;</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160;                <span class="comment">// remove vertex form its doubly linked list</span></div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160;                <span class="keywordflow">if</span> (prev[imaxantideg] == r) {</div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;                        satdeglist[maxsatdeg] = next[imaxantideg];</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;                        <span class="keywordflow">if</span> (ncovered &lt; r - 1)</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160;                                <span class="keywordflow">while</span> (satdeglist[maxsatdeg] == r)</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;                                        maxsatdeg--;</div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;                }</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;                        next[prev[imaxantideg]] = next[imaxantideg];</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160;                prev[next[imaxantideg]] = prev[imaxantideg];</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;                <span class="comment">// find clique to include vertex as the smallest</span></div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160;                <span class="comment">// not appearing in the neighborhood of imaxantideg</span></div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;                <span class="keywordtype">long</span> c = <a class="code" href="GraphAlgorithm_8h.html#a32e148dcccc8b8059e1760623f81b84c">graphs_assignByList</a>(d, ng, k, rank, imaxantideg, &amp;nclique, clique);</div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;</div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;                <span class="comment">// update satdeglist</span></div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;                <span class="keywordflow">if</span> (c &lt;= k)</div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;                        <span class="keywordflow">for</span> (i = 0; i &lt; d[imaxantideg]; i++) {</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;                                <span class="keywordtype">long</span> ii = ng[imaxantideg][i];</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;                                <span class="keywordflow">if</span> (!rank[ii]) {</div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;                                        <span class="keywordflow">for</span> (j = 0; j &lt; d[ii] &amp;&amp; (ng[ii][j] == imaxantideg || rank[ng[ii][j]] != c); j++);</div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;                                        <span class="keywordflow">if</span> (j == d[ii]) {</div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;                                                <span class="comment">// remove i from list</span></div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160;                                                <span class="keywordflow">if</span> (prev[ii] == r)</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;                                                        satdeglist[satdeg[ii]] = next[ii];</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;                                                <span class="keywordflow">else</span></div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;                                                        next[prev[ii]] = next[ii];</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;                                                prev[next[ii]] = prev[ii];</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160;                                                <span class="comment">// insert i in next list</span></div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;                                                satdeg[ii]++;</div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;                                                next[ii] = satdeglist[satdeg[ii]];</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;                                                prev[ii] = r;</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;                                                prev[satdeglist[satdeg[ii]]] = ii;</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;                                                satdeglist[satdeg[ii]] = ii;</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160;                                                <span class="keywordflow">if</span> (satdeg[ii] &gt; maxsatdeg)</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;                                                        maxsatdeg = satdeg[ii];</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;                                        }</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;                                }</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;                        }</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;        }</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;        <span class="keywordflow">return</span> nclique;</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160;}</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;<span class="comment">// sort R according to a clique cover of the subgraph induced by R,</span></div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160;<span class="comment">// using the symmetric adjacency matrix</span></div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160;<span class="comment">// clique cover is determined using dsatur</span></div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160;<span class="comment">// 5 vectors of r longegers are defined in the C function stack</span></div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160;<span class="comment">// it returns the size of the clique cover and sets the cover array such that:</span></div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160;<span class="comment">// for i in 0, ..., r-1, the entry cover[i] contains the size of a clique</span></div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;<span class="comment">// cover of the subgraph induced by all vertices of rank less than or equal to cover[i]</span></div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>&#160;<span class="comment">// the number of cliques in the cover is returned. Cliques returned in the cover array are numbered from 1 to number of cliques in the</span></div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T, <span class="keyword">typename</span> Z&gt;</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160;<span class="keywordtype">long</span> <a class="code" href="classGraphAlgorithm.html#a39dce6a44f59201d547bd35a64f6a894" title="Determines a greedy coloring of the subgraph induced by the specified vertices using the Dsatur algor...">GraphAlgorithm&lt;T, Z&gt;::dsaturCoverSort</a>(<a class="code" href="classGraph.html">Graph&lt;T&gt;</a>* g, <span class="keywordtype">long</span> k, <span class="keywordtype">long</span>* rank) {</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160;        <span class="keywordtype">long</span> r = g-&gt;<a class="code" href="classDiGraph.html#a112496425c69ad1f5f609ee9021f4f3f" title="The number of vertices.">nverts</a>();</div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160;        <a class="code" href="GraphAlgorithm_8h.html#a5323a965dacf2a0b2899756ea7757903">graphs_declareListForAssignment</a>(r, k);</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160;</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160;        <span class="keywordtype">long</span> antideg[r];</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160;        <span class="keywordtype">long</span> next[r+1];</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160;        <span class="keywordtype">long</span> prev[r+1];</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>&#160;        <span class="keywordtype">long</span> satdeglist[r];</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>&#160;        <span class="keywordtype">long</span> satdeg[r];</div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>&#160;        <span class="keywordtype">long</span> nclique = 0;</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>&#160;</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>&#160;        <span class="keywordtype">long</span> i, j;</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>&#160;</div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>&#160;        <span class="comment">// initially, all cliques are empty, all saturation degrees are 0 and</span></div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>&#160;        <span class="comment">// its doubly linked list contains all vertices</span></div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>&#160;        memset(rank, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>&#160;        memset(satdeg, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>&#160;        memset(antideg, 0, r*<span class="keyword">sizeof</span>(<span class="keywordtype">long</span>));</div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++) {</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160;                next[i] = i+1;</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160;                prev[i] = i-1;</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160;                satdeglist[i] = r;</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160;                <span class="keywordflow">for</span> (j = i + 1; j &lt; r; j++)</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160;                        <span class="keywordflow">if</span> (!g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(i, j)) {</div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160;                                antideg[i]++;</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160;                                antideg[j]++;</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160;                        }</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160;        }</div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160;        satdeglist[0] = 0;</div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160;        prev[0] = r;</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>&#160;</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160;        <span class="keywordtype">long</span> ncovered;</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160;        <span class="keywordtype">long</span> maxsatdeg = 0;</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160;        <span class="keywordtype">long</span> imaxantideg;</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160;        <span class="keywordflow">for</span> (ncovered = 0; ncovered &lt; r; ncovered++) {</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160;                <span class="comment">// find vertex with max antideg among those with max satdeg</span></div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>&#160;                i = satdeglist[maxsatdeg];</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160;                imaxantideg = i;</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160;                <span class="keywordflow">while</span> (next[i] &lt; r) {</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160;                        i = next[i];</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160;                        <span class="keywordflow">if</span> (antideg[i] &gt; antideg[imaxantideg])</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160;                                imaxantideg = i;</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>&#160;                }</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>&#160;</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>&#160;                <span class="comment">// remove vertex form its doubly linked list</span></div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>&#160;                <span class="keywordflow">if</span> (prev[imaxantideg] == r) {</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>&#160;                        satdeglist[maxsatdeg] = next[imaxantideg];</div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>&#160;                        <span class="keywordflow">if</span> (ncovered &lt; r - 1)</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>&#160;                                <span class="keywordflow">while</span> (satdeglist[maxsatdeg] == r)</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>&#160;                                        maxsatdeg--;</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>&#160;                }</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>&#160;                        next[prev[imaxantideg]] = next[imaxantideg];</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160;                prev[next[imaxantideg]] = prev[imaxantideg];</div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160;</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160;                <span class="keywordtype">long</span> c = <a class="code" href="GraphAlgorithm_8h.html#ae1579b0f05e45332ca5dd69c2c3b3bb8">callAssignClique</a>(g, k, rank, imaxantideg, nclique);</div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>&#160;</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160;                <span class="comment">// update satdeglist</span></div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160;                <span class="keywordflow">if</span> (c &lt;= k)</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160;                        <span class="keywordflow">for</span> (i = 0; i &lt; r; i++)</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160;                                <span class="keywordflow">if</span> (!g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(imaxantideg, i) &amp;&amp; !rank[i]) {</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160;                                        <span class="keywordflow">for</span> (j = 0; j &lt; r &amp;&amp; (g-&gt;<a class="code" href="classDiGraph.html#afc1bb0b45d04fe3819e8e9be16d2a764" title="Queries for an edge.">hasEdge</a>(i, j) || j == imaxantideg || rank[j] != c); j++);</div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160;                                        <span class="keywordflow">if</span> (j == r) {</div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160;                                                <span class="comment">// remove i from list</span></div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160;                                                <span class="keywordflow">if</span> (prev[i] == r)</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160;                                                        satdeglist[satdeg[i]] = next[i];</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160;                                                <span class="keywordflow">else</span></div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160;                                                        next[prev[i]] = next[i];</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160;                                                prev[next[i]] = prev[i];</div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160;</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160;                                                <span class="comment">// insert i in next list</span></div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160;                                                satdeg[i]++;</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160;                                                next[i] = satdeglist[satdeg[i]];</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160;                                                prev[i] = r;</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160;                                                prev[satdeglist[satdeg[i]]] = i;</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160;                                                satdeglist[satdeg[i]] = i;</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>&#160;</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160;                                                <span class="keywordflow">if</span> (satdeg[i] &gt; maxsatdeg)</div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160;                                                        maxsatdeg = satdeg[i];</div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160;                                        }</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160;                                }</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;        }</div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;        <span class="keywordflow">return</span> nclique;</div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;}</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;</div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>&#160;</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* GRAPHALGORITHM_H_ */</span><span class="preprocessor"></span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Nov 21 2012 19:21:02 for Data Structures for Sets and Graphs by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
